Update on Primality Testing
نویسنده
چکیده
We discuss recent developments in the field of primality testing since the appearance [10] of our joint paper On primes recognizable in deterministic polynomial time.
منابع مشابه
PRIMALITY TESTING TECHNIQUES AND THE IMPORTANCE OF PRIME NUMBERS IN SECURITY PROTOCOLS Research Assistant
This study presents primality testing by mostly emphasizing on probabilistic primality tests. It is proposed an algorithm for the generation and testing of primes, and explained Carmichael numbers. The importance of prime numbers in encryption is stated and experimental results are given. KeywordsPrime Numbers, Carmichael Numbers, Primality Tests, Prime Generation, Security Protocols, Factoriza...
متن کاملPrimality Proving Using Elliptic Curves: An Update
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the one hand, and Atkin on the other. The latter algorithm uses the theory of complex multiplication. The algorithm, now called ECPP, has been used for nearly ten years. The purpose of this paper is to give an account of th...
متن کاملPrimality Tests Based on Fermat's Little Theorem
In this survey, we describe three algorithms for testing primality of numbers that use Fermat’s Little Theorem.
متن کاملPrimality Tests Using Algebraic Groups
The first deterministic polynomial-time algorithm for primality testing by Agrawal, Kayal, and Saxena [Agrawal et al. 02] has been epoch-making. On the other hand, some previously known primality (or pseudoprimality) tests are still of interest not only because they are faster practically but also because they offer interesting mathematical objects such as pseudoprimes. The aim of this paper is...
متن کاملAn Overview of Elliptic Curve Primality Proving
Primes are of fundamental importance in number theory, and primality testing is one of the oldest problems in mathematics. Various algorithms have been presented over the past two millenia, ever since Eratosthenes detailed his eponymous sieve in 274 B.C. After important theoretical advances by Fermat, Euler, Legendre, and Gauss in the seventeeth and eighteenth centuries, the rise of computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013